Transshipment Through Crossdocks with Inventory and Time Windows

نویسندگان

  • Andrew Lim
  • Zhaowei Miao
  • Brian Rodrigues
  • Zhou Xu
چکیده

The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has been to coordinate transshipment activities across the chain aimed at reducing costs and increasing service levels in the face of a range of factors, including demand fluctuations, short lead times, warehouse limitations and transportation and inventory costs. The success in implementing push-pull strategies, when firms change from one strategy to another in managing the chain and where time lines are crucial, is dependent on adaptive transshipment scheduling. Yet again, in transshipment through crossdocks, where justin-time objectives prevail, precise scheduling between suppliers, crossdocks and customers is required to avoid inventory backups or delays. This paper studies transshipment with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities with the objective to minimize costs, including inventory costs. Transportation is provided through flexible schedules and lot-sizing is dealt with in the models through multiple shipments. We propose polynomial time algorithms or show the complexity of problems studied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple crossdocks with inventory and time windows

Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consideration delivery and pickup time windows, warehouse capacities and inventory handling costs. Because of the complexity of the problem, local search techniques are developed and used with simulated annealing and tabu se...

متن کامل

A Hybrid Genetic Algorithm for the Multiple Crossdocks Problem

We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be NP-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure,...

متن کامل

Considering Production Planning in the Multi-period Inventory Routing Problem with Transshipment between Retailers

Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...

متن کامل

Multi-agent Simulation for the transshipment problem with a non-negligible transfer lead time and a limited transportation mean capacity

We consider a supply chain consisting of n locations replenished at the beginning of each period by a supplier. These locations may coordinate in order to balance their inventory level through transshipment. Transshipment is the items transfer from location having an inventory excess to another in need. The transshipment problem consists to determine the initial inventory level where a transshi...

متن کامل

Greedy Local Improvement of SPEA2 Algorithm to Solve the Multiobjective Capacitated Transshipment Problem

We consider a multi-location inventory system where inventory choices at each location are centrally coordinated through the use of lateral Transshipments. This cooperation between different locations of the same echelon level often leads to cost reduction and service level improvement. However, when some locations face embarrassing storage capacity limits, inventory sharing through transshipme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004